A wareness, belief, and communication reaching consensus
نویسندگان
چکیده
منابع مشابه
Reaching a Consensus
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...
متن کاملProtocols for belief merge: Reaching agreement via communication
We investigate the issue of reaching doxastic agreement among the agents of a group by “sharing” information via successive acts of sincere, persuasive and public communication within the group. The topic relates to “preference aggregation” in Social Choice theory, where the problem is to find a natural and fair merge operation for aggregating the agents’ preferences into a single group prefere...
متن کاملReaching Approximate Byzantine Consensus with Multi-hop Communication
We address the problem of reaching consensus in the presence of Byzantine faults. Fault-tolerant consensus algorithms typically assume knowledge of nonlocal information and multi-hop communication; however, this assumption is not suitable for large-scale static/dynamic networks. A handful of iterative algorithms have been proposed recently under the assumption that each node (faulty or fault-fr...
متن کاملConsensus reaching in committees
In this paper, we apply a consensus model to decision-making in committees that have to choose one or more alternatives from a set of alternatives. Decision makers may be advised to adjust their preferences in order to obtain a better consensus. A simple example is presented.
متن کاملReaching Consensus on Decisions
We investigate how like-minded agents can reach consensus on their decisions even if they receive different information. The model used here was introduced by Aumann, and subsequently refined by Geanakoplos and Polemarchakis, Bacharach, Cave, Parikh and Krasucki ([Aum76,GP82,Cav83,Bac85,PK]). The main result is that when any number of like-minded agents communicate according to some fair protoc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Decision Sciences
سال: 2004
ISSN: 1173-9126
DOI: 10.1155/s1173912604000112